The timetable constrained distance minimization problem
نویسندگان
چکیده
منابع مشابه
The Timetable Constrained Distance Minimization Problem
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given. We present an integer programming, a constraint programming formulation and describ...
متن کاملThe multi-objective railway timetable rescheduling problem
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. The originality of our approach is to integrate three objectives to generate a disposition timetable: the passenger satisfact...
متن کاملDecomposing the High School Timetable Problem
The process of timetable construction is a common and repetitive task for High Schools worldwide. In this paper a generic approach is presented for Greek High Schools organized around the idea of solving a significant number of tractable Integer Programming problems. Variables of the underlying mathematical model correspond to daily teacher schedules while a number of hard and soft constraints ...
متن کاملEigenvalue analysis of constrained minimization problem for homogeneous polynomial
In this paper, the concepts of Pareto H -eigenvalue and Pareto Z -eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at least one Pareto H -eigenvalue (Pareto Z -eigenvalue). Furthermore, theminimumPareto H -eigenvalue (or Pareto Z -eigenvalue) of a symmetric ...
متن کاملThe capacity and distance constrained plant location problem
This article introduces a new problem called the Capacity and Distance Constrained Plant Location Problem. It is an extension of the discrete capacitated plant location problem, where the customers assigned to each plant have to be packed in groups that will be served by one vehicle each. The paper addresses different modeling aspects of the problem. It describes a tabu search algorithm for its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2008
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-008-0384-4